Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks the observed level of cooperation is the same. We thus show that when human subjects interact in an heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.Comment: 5 Pages including 4 figures. Submitted for publicatio

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

While many tailor made card game protocols are known, the vast majority of those suffer from three main issues: lack of mechanisms for distributing financial rewards and punishing cheaters, lack of composability guarantees and little flexibility, focusing on the specific game of poker. Even though folklore holds that poker protocols can be used to play any card game, this conjecture remains unproven and, in fact, does not hold for a number of protocols (including recent results). We both tackle the problem of constructing protocols for general card games and initiate a treatment of such protocols in the Universal Composability (UC) framework, introducing an ideal functionality that captures general card games constructed from a set of core card operations. Based on this formalism, we introduce Royale, the first UC-secure general card games which supports financial rewards/penalties enforcement. We remark that Royale also yields the first UC-secure poker protocol. Interestingly, Royale performs better than most previous works (that do not have composability guarantees), which we highlight through a detailed concrete complexity analysis and benchmarks from a prototype implementation

Mesoscopic structure conditions the emergence of cooperation on social networks

We study the evolutionary Prisoner's Dilemma on two social networks obtained from actual relational data. We find very different cooperation levels on each of them that can not be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding perfect agreement with the observations in the real networks. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.Comment: Largely improved version, includes an artificial network model that fully confirms the explanation of the results in terms of inter- and intra-community structur

Different reactions to adverse neighborhoods in games of cooperation

In social dilemmas, cooperation among randomly interacting individuals is often difficult to achieve. The situation changes if interactions take place in a network where the network structure jointly evolves with the behavioral strategies of the interacting individuals. In particular, cooperation can be stabilized if individuals tend to cut interaction links when facing adverse neighborhoods. Here we consider two different types of reaction to adverse neighborhoods, and all possible mixtures between these reactions. When faced with a gloomy outlook, players can either choose to cut and rewire some of their links to other individuals, or they can migrate to another location and establish new links in the new local neighborhood. We find that in general local rewiring is more favorable for the evolution of cooperation than emigration from adverse neighborhoods. Rewiring helps to maintain the diversity in the degree distribution of players and favors the spontaneous emergence of cooperative clusters. Both properties are known to favor the evolution of cooperation on networks. Interestingly, a mixture of migration and rewiring is even more favorable for the evolution of cooperation than rewiring on its own. While most models only consider a single type of reaction to adverse neighborhoods, the coexistence of several such reactions may actually be an optimal setting for the evolution of cooperation.Comment: 12 pages, 5 figures; accepted for publication in PLoS ON

Social Experiments in the Mesoscale: Humans Playing a Spatial Prisoner's Dilemma

Background: The evolutionary origin of cooperation among unrelated individuals remains a key unsolved issue across several disciplines. Prominent among the several mechanisms proposed to explain how cooperation can emerge is the existence of a population structure that determines the interactions among individuals. Many models have explored analytically and by simulation the effects of such a structure, particularly in the framework of the Prisoner’s Dilemma, but the results of these models largely depend on details such as the type of spatial structure or the evolutionary dynamics. Therefore, experimental work suitably designed to address this question is needed to probe these issues. Methods and Findings: We have designed an experiment to test the emergence of cooperation when humans play Prisoner’s Dilemma on a network whose size is comparable to that of simulations. We find that the cooperation level declines to an asymptotic state with low but nonzero cooperation. Regarding players ’ behavior, we observe that the population is heterogeneous, consisting of a high percentage of defectors, a smaller one of cooperators, and a large group that shares features of the conditional cooperators of public goods games. We propose an agent-based model based on the coexistence of these different strategies that is in good agreement with all the experimental observations. Conclusions: In our large experimental setup, cooperation was not promoted by the existence of a lattice beyond a residual level (around 20%) typical of public goods experiments. Our findings also indicate that both heterogeneity and a ‘‘moody’

The impact of childhood vaccines on bacterial carriage in the nasopharynx: a longitudinal study.

BACKGROUND: There is increasing evidence that childhood vaccines have effects that extend beyond their target disease. The objective of this study was to assess the effects of routine childhood vaccines on bacterial carriage in the nasopharynx. METHODS: A cohort of children from rural Gambia was recruited at birth and followed up for one year. Nasopharyngeal swabs were taken immediately after birth, every two weeks for the first six months and then every other month. The presence of bacteria in the nasopharynx (Haemophilus influenzae, Streptococcus pneumoniae, Staphylococcus aureus) was compared before and after the administration of DTP-Hib-HepB and measles-yellow fever vaccines. RESULTS: A total of 1,779 nasopharyngeal swabs were collected from 136 children for whom vaccination data were available. The prevalence of bacterial carriage was high: 82.2% S. pneumoniae, 30.6%, S.aureus, 27.8% H. influenzae. Carriage of H. influenzae (OR = 0.36; 95% CI: 0.13, 0.99) and S. pneumoniae (OR = 0.25; 95% CI: 0.07, 0.90) were significantly reduced after measles-yellow fever vaccination; while DTP-Hib-HepB had no effect on bacterial carriage. CONCLUSIONS: Nasopharyngeal bacterial carriage is unaffected by DTP-Hib-HepB vaccination and reduced after measles-yellow fever vaccination

Wisdom of groups promotes cooperation in evolutionary social dilemmas

Whether or not to change strategy depends not only on the personal success of each individual, but also on the success of others. Using this as motivation, we study the evolution of cooperation in games that describe social dilemmas, where the propensity to adopt a different strategy depends both on individual fitness as well as on the strategies of neighbors. Regardless of whether the evolutionary process is governed by pairwise or group interactions, we show that plugging into the "wisdom of groups" strongly promotes cooperative behavior. The more the wider knowledge is taken into account the more the evolution of defectors is impaired. We explain this by revealing a dynamically decelerated invasion process, by means of which interfaces separating different domains remain smooth and defectors therefore become unable to efficiently invade cooperators. This in turn invigorates spatial reciprocity and establishes decentralized decision making as very beneficial for resolving social dilemmas.Comment: 8 two-column pages, 7 figures; accepted for publication in Scientific Report

If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation

Spatial reciprocity is a well known tour de force of cooperation promotion. A thorough understanding of the effects of different population densities is therefore crucial. Here we study the evolution of cooperation in social dilemmas on different interaction graphs with a certain fraction of vacant nodes. We find that sparsity may favor the resolution of social dilemmas, especially if the population density is close to the percolation threshold of the underlying graph. Regardless of the type of the governing social dilemma as well as particularities of the interaction graph, we show that under pairwise imitation the percolation threshold is a universal indicator of how dense the occupancy ought to be for cooperation to be optimally promoted. We also demonstrate that myopic updating, due to the lack of efficient spread of information via imitation, renders the reported mechanism dysfunctional, which in turn further strengthens its foundations.Comment: 6 two-column pages, 5 figures; accepted for publication in Scientific Reports [related work available at http://arxiv.org/abs/1205.0541

Interdependent network reciprocity in evolutionary games

Besides the structure of interactions within networks, also the interactions between networks are of the outmost importance. We therefore study the outcome of the public goods game on two interdependent networks that are connected by means of a utility function, which determines how payoffs on both networks jointly influence the success of players in each individual network. We show that an unbiased coupling allows the spontaneous emergence of interdependent network reciprocity, which is capable to maintain healthy levels of public cooperation even in extremely adverse conditions. The mechanism, however, requires simultaneous formation of correlated cooperator clusters on both networks. If this does not emerge or if the coordination process is disturbed, network reciprocity fails, resulting in the total collapse of cooperation. Network interdependence can thus be exploited effectively to promote cooperation past the limits imposed by isolated networks, but only if the coordination between the interdependent networks is not disturbe

Resolution of the stochastic strategy spatial prisoner's dilemma by means of particle swarm optimization

We study the evolution of cooperation among selfish individuals in the stochastic strategy spatial prisoner's dilemma game. We equip players with the particle swarm optimization technique, and find that it may lead to highly cooperative states even if the temptations to defect are strong. The concept of particle swarm optimization was originally introduced within a simple model of social dynamics that can describe the formation of a swarm, i.e., analogous to a swarm of bees searching for a food source. Essentially, particle swarm optimization foresees changes in the velocity profile of each player, such that the best locations are targeted and eventually occupied. In our case, each player keeps track of the highest payoff attained within a local topological neighborhood and its individual highest payoff. Thus, players make use of their own memory that keeps score of the most profitable strategy in previous actions, as well as use of the knowledge gained by the swarm as a whole, to find the best available strategy for themselves and the society. Following extensive simulations of this setup, we find a significant increase in the level of cooperation for a wide range of parameters, and also a full resolution of the prisoner's dilemma. We also demonstrate extreme efficiency of the optimization algorithm when dealing with environments that strongly favor the proliferation of defection, which in turn suggests that swarming could be an important phenomenon by means of which cooperation can be sustained even under highly unfavorable conditions. We thus present an alternative way of understanding the evolution of cooperative behavior and its ubiquitous presence in nature, and we hope that this study will be inspirational for future efforts aimed in this direction.Comment: 12 pages, 4 figures; accepted for publication in PLoS ON